Exhaustive Generation of Some Classes of Pattern Avoiding Permutations Using Succession Functions
نویسنده
چکیده
ECO-method and its corresponding succession rules allow to recursively define and construct combinatorial objects. We introduce here succession functions which refine succession rules. They permit to construct general efficient algorithms for classes of combinatorial objects and to find some new classes more easily than previous methods. We apply succession function technique for a lot of classes of pattern avoiding permutations and derive general constant amortized time generating algorithms for them. This paper is dedicated to Don Knuth who initiated 35 years ago the field of pattern avoiding permutations.
منابع مشابه
Combinatorial Gray codes for classes of pattern avoiding permutations
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoid...
متن کاملECO-generation for some restricted classes of compositions
We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method [8], new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.
متن کاملThe Enumeration of Maximally Clustered Permutations
The maximally clustered permutations are characterized by avoiding the classical permutation patterns {3421, 4312, 4321}. This class contains the freely braided permutations and the fully commutative permutations. In this work, we show that the generating functions for certain fully commutative pattern classes can be transformed to give generating functions for the corresponding freely braided ...
متن کاملGenerating trees for permutations avoiding generalized patterns
We construct generating trees with with one and two labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, instead of inserting always the largest entry. This allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. W...
متن کاملOn the Generation and Enumeration of some Classes of Convex Polyominoes
ECO is a method for the recursive generation, and thereby also the enumeration of classes of combinatorial objects. It has already found successful application in recent literature both to the exhaustive generation and to the uniform random generation of various objects classified according to several parameters of interest, as well as to their enumeration. In this paper we extend this approach...
متن کامل